0.11/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.37	% Computer   : n007.cluster.edu
0.15/0.37	% Model      : x86_64 x86_64
0.15/0.37	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.37	% Memory     : 8042.1875MB
0.15/0.37	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.37	% CPULimit   : 1200
0.15/0.37	% WCLimit    : 120
0.15/0.37	% DateTime   : Tue Jul 13 16:08:34 EDT 2021
0.15/0.37	% CPUTime    : 
0.15/0.37	% Number of cores: 8
0.15/0.37	% Python version: Python 3.6.8
0.15/0.38	# Version: 2.6rc1-ho
0.15/0.39	# No SInE strategy applied
0.15/0.39	# Trying AutoSched0 for 59 seconds
0.56/0.78	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.56/0.78	# and selection function SelectMaxLComplexAvoidPosPred.
0.56/0.78	#
0.56/0.78	# Preprocessing time       : 0.073 s
0.56/0.78	
0.56/0.78	# Proof found!
0.56/0.78	# SZS status Theorem
0.56/0.78	# SZS output start CNFRefutation
0.56/0.78	thf(fact_176_less__le__trans, axiom, ![X1:nat, X2:nat, X30:nat]:(ord_less_nat @ X1 @ X2=>(ord_less_eq_nat @ X2 @ X30=>ord_less_nat @ X1 @ X30)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_176_less__le__trans)).
0.56/0.78	thf(fact_20_progress__le, axiom, ![X37:trace_1367752404list_a, X38:formula_a, X24:nat]:ord_less_eq_nat @ (monito1457594016ress_a @ X37 @ X38 @ X24) @ X24, file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_20_progress__le)).
0.56/0.78	thf(conj_0, conjecture, ord_less_nat @ k @ (plen_P694648887list_a @ pi), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
0.56/0.78	thf(fact_0__092_060open_062k_A_060_AMonitor__Mirabelle__prbptmgypa_Oprogress_A_092_060sigma_062_A_092_060phi_0621_A_Iplen_A_092_060pi_062_J_092_060close_062, axiom, ord_less_nat @ k @ (monito1457594016ress_a @ sigma @ phi_1 @ (plen_P694648887list_a @ pi)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0__092_060open_062k_A_060_AMonitor__Mirabelle__prbptmgypa_Oprogress_A_092_060sigma_062_A_092_060phi_0621_A_Iplen_A_092_060pi_062_J_092_060close_062)).
0.56/0.78	thf(c_0_4, plain, ![X1125:nat, X1126:nat, X1127:nat]:(~ord_less_nat @ X1125 @ X1126|(~ord_less_eq_nat @ X1126 @ X1127|ord_less_nat @ X1125 @ X1127)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_176_less__le__trans])])).
0.56/0.78	thf(c_0_5, plain, ![X1154:trace_1367752404list_a, X1155:formula_a, X1156:nat]:ord_less_eq_nat @ (monito1457594016ress_a @ X1154 @ X1155 @ X1156) @ X1156, inference(variable_rename,[status(thm)],[fact_20_progress__le])).
0.56/0.78	thf(c_0_6, plain, ![X1:nat, X2:nat, X3:nat]:(ord_less_nat @ X1 @ X3|~ord_less_nat @ X1 @ X2|~ord_less_eq_nat @ X2 @ X3), inference(split_conjunct,[status(thm)],[c_0_4])).
0.56/0.78	thf(c_0_7, plain, ![X38:formula_a, X14:trace_1367752404list_a, X1:nat]:ord_less_eq_nat @ (monito1457594016ress_a @ X14 @ X38 @ X1) @ X1, inference(split_conjunct,[status(thm)],[c_0_5])).
0.56/0.78	thf(c_0_8, negated_conjecture, ~ord_less_nat @ k @ (plen_P694648887list_a @ pi), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.56/0.78	thf(c_0_9, plain, ![X1:nat, X38:formula_a, X14:trace_1367752404list_a, X2:nat]:(ord_less_nat @ X1 @ X2|~ord_less_nat @ X1 @ (monito1457594016ress_a @ X14 @ X38 @ X2)), inference(spm,[status(thm)],[c_0_6, c_0_7])).
0.56/0.78	thf(c_0_10, plain, ord_less_nat @ k @ (monito1457594016ress_a @ sigma @ phi_1 @ (plen_P694648887list_a @ pi)), inference(split_conjunct,[status(thm)],[fact_0__092_060open_062k_A_060_AMonitor__Mirabelle__prbptmgypa_Oprogress_A_092_060sigma_062_A_092_060phi_0621_A_Iplen_A_092_060pi_062_J_092_060close_062])).
0.56/0.78	thf(c_0_11, negated_conjecture, ~ord_less_nat @ k @ (plen_P694648887list_a @ pi), inference(split_conjunct,[status(thm)],[c_0_8])).
0.56/0.78	thf(c_0_12, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), ['proof']).
0.56/0.78	# SZS output end CNFRefutation
0.56/0.78	# Proof object total steps             : 13
0.56/0.78	# Proof object clause steps            : 6
0.56/0.78	# Proof object formula steps           : 7
0.56/0.78	# Proof object conjectures             : 3
0.56/0.78	# Proof object clause conjectures      : 1
0.56/0.78	# Proof object formula conjectures     : 2
0.56/0.78	# Proof object initial clauses used    : 4
0.56/0.78	# Proof object initial formulas used   : 4
0.56/0.78	# Proof object generating inferences   : 2
0.56/0.78	# Proof object simplifying inferences  : 1
0.56/0.78	# Training examples: 0 positive, 0 negative
0.56/0.78	# Parsed axioms                        : 315
0.56/0.78	# Removed by relevancy pruning/SinE    : 0
0.56/0.78	# Initial clauses                      : 663
0.56/0.78	# Removed in clause preprocessing      : 46
0.56/0.78	# Initial clauses in saturation        : 617
0.56/0.78	# Processed clauses                    : 1238
0.56/0.78	# ...of these trivial                  : 33
0.56/0.78	# ...subsumed                          : 456
0.56/0.78	# ...remaining for further processing  : 749
0.56/0.78	# Other redundant clauses eliminated   : 66
0.56/0.78	# Clauses deleted for lack of memory   : 0
0.56/0.78	# Backward-subsumed                    : 10
0.56/0.78	# Backward-rewritten                   : 16
0.56/0.78	# Generated clauses                    : 13655
0.56/0.78	# ...of the previous two non-trivial   : 13308
0.56/0.78	# Contextual simplify-reflections      : 2
0.56/0.78	# Paramodulations                      : 13565
0.56/0.78	# Factorizations                       : 10
0.56/0.78	# NegExts                              : 0
0.56/0.78	# Equation resolutions                 : 76
0.56/0.78	# Propositional unsat checks           : 0
0.56/0.78	#    Propositional check models        : 0
0.56/0.78	#    Propositional check unsatisfiable : 0
0.56/0.78	#    Propositional clauses             : 0
0.56/0.78	#    Propositional clauses after purity: 0
0.56/0.78	#    Propositional unsat core size     : 0
0.56/0.78	#    Propositional preprocessing time  : 0.000
0.56/0.78	#    Propositional encoding time       : 0.000
0.56/0.78	#    Propositional solver time         : 0.000
0.56/0.78	#    Success case prop preproc time    : 0.000
0.56/0.78	#    Success case prop encoding time   : 0.000
0.56/0.78	#    Success case prop solver time     : 0.000
0.56/0.78	# Current number of processed clauses  : 668
0.56/0.78	#    Positive orientable unit clauses  : 57
0.56/0.78	#    Positive unorientable unit clauses: 2
0.56/0.78	#    Negative unit clauses             : 123
0.56/0.78	#    Non-unit-clauses                  : 486
0.56/0.78	# Current number of unprocessed clauses: 12640
0.56/0.78	# ...number of literals in the above   : 61341
0.56/0.78	# Current number of archived formulas  : 0
0.56/0.78	# Current number of archived clauses   : 27
0.56/0.78	# Clause-clause subsumption calls (NU) : 36304
0.56/0.78	# Rec. Clause-clause subsumption calls : 10556
0.56/0.78	# Non-unit clause-clause subsumptions  : 327
0.56/0.78	# Unit Clause-clause subsumption calls : 4209
0.56/0.78	# Rewrite failures with RHS unbound    : 0
0.56/0.78	# BW rewrite match attempts            : 51
0.56/0.78	# BW rewrite match successes           : 38
0.56/0.78	# Condensation attempts                : 0
0.56/0.78	# Condensation successes               : 0
0.56/0.78	# Termbank termtop insertions          : 301799
0.56/0.78	
0.56/0.78	# -------------------------------------------------
0.56/0.78	# User time                : 0.389 s
0.56/0.78	# System time              : 0.021 s
0.56/0.78	# Total time               : 0.410 s
0.56/0.78	# Maximum resident set size: 2228 pages
0.56/0.79	EOF
